翻訳と辞書 Words near each other ・ Restricted Data ・ Restricted Duty Ribbon ・ Restricted Enforcement Unit ・ Restricted foster home ・ Restricted free agent ・ Restricted Growth Association ・ Restricted isometry property ・ Restricted Lie algebra ・ Restricted Line Officer ・ Restricted maximum likelihood ・ Restricted military area ・ Restricted open-shell Hartree–Fock ・ Restricted partial quotients ・ Restricted product ・ Restricted randomization ・ Restricted representation ・ Restricted root system ・ Restricted Service Licence ・ Restricted shell ・ Restricted stations of Line 1, Beijing Subway ・ Restricted stock ・ Restricted sumset ・ Restricted use pesticide ・ Restricted-access barrier system ・ Restriction ・ Restriction (Archive album) ・ Restriction (mathematics) ・ Restriction digest ・ Restriction endonuclease BsobI/AvaI ・ Restriction enzyme Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Restricted representation ： ウィキペディア英語版 Restricted representation In mathematics, restriction is a fundamental construction in representation theory of groups. Restriction forms a representation of a subgroup from a representation of the whole group. Often the restricted representation is simpler to understand. Rules for decomposing the restriction of an irreducible representation into irreducible representations of the subgroup are called branching rules, and have important applications in physics. For example, in case of explicit symmetry breaking, the symmetry group of the problem is reduced from the whole group to one of its subgroups. In quantum mechanics, this reduction in symmetry appears as a splitting of degenerate energy levels into multiplets, as in the Stark or Zeeman effect. The induced representation is a related operation that forms a representation of the whole group from a representation of a subgroup. The relation between restriction and induction is described by Frobenius reciprocity and the Mackey theorem. Restriction to a normal subgroup behaves particularly well and is often called Clifford theory after the theorem of A. H. Clifford.〔.〕 Restriction can be generalized to other group homomorphisms and to other rings. For any group ''G'', its subgroup ''H'', and a linear representation ''ρ'' of ''G'', the restriction of ''ρ'' to ''H'', denoted :ρ|''H'', is a representation of ''H'' on the same vector space by the same operators: :ρ|''H''(''h'') = ρ(''h''). == Classical branching rules == Classical branching rules describe the restriction of an irreducible representation (π, ''V'') of a classical group ''G'' to a classical subgroup ''H'', i.e. the multiplicity with which an irreducible representation (σ, ''W'') of ''H'' occurs in π. By Frobenius reciprocity for compact groups, this is equivalent to finding the multiplicity of π in the unitary representation induced from σ. Branching rules for the classical groups were determined by * between successive unitary groups; * between successive special orthogonal groups and unitary symplectic groups; * from the unitary groups to the unitary symplectic groups and special orthogonal groups. The results are usually expressed graphically using Young diagrams to encode the signatures used classically to label irreducible representations, familiar from classical invariant theory. Hermann Weyl and Richard Brauer discovered a systematic method for determining the branching rule when the groups ''G'' and ''H'' share a common maximal torus: in this case the Weyl group of ''H'' is a subgroup of that of ''G'', so that the rule can be deduced from the Weyl character formula. A systematic modern interpretation has been given by in the context of his theory of dual pairs. The special case where σ is the trivial representation of ''H'' was first used extensively by Hua in his work on the Szegő kernels of bounded symmetric domains in several complex variables, where the Shilov boundary has the form ''G''/''H''. More generally the Cartan-Helgason theorem gives the decomposition when ''G''/''H'' is a compact symmetric space, in which case all multiplicities are one; a generalization to arbitrary σ has since been obtained by . Similar geometric considerations have also been used by to rederive Littlewood's rules, which involve the celebrated Littlewood–Richardson rules for tensoring irreducible representations of the unitary groups. has found generalizations of these rules to arbitrary compact semisimple Lie groups, using his path model, an approach to representation theory close in spirit to the theory of crystal bases of Lusztig and Kashiwara. His methods yield branching rules for restrictions to subgroups containing a maximal torus. The study of branching rules is important in classical invariant theory and its modern counterpart, algebraic combinatorics. Example. The unitary group ''U(N)'' has irreducible representations labelled by signatures :$\backslash mathbf\; \backslash ,\backslash colon\; \backslash ,f\_1\backslash ge\; f\_2\backslash ge\; \backslash cdots\; \backslash ge\; f\_N$ where the ''f''''i'' are integers. In fact if a unitary matrix ''U'' has eigenvalues ''z''''i'', then the character of the corresponding irreducible representation πf is given by :$\backslash mathrm\; \backslash ,\; \backslash pi\_\backslash ,\; z\_j^\backslash over\; \backslash prod\_\; (z\_i-z\_j)\}.$ The branching rule from ''U(N)'' to ''U(N – 1)'' states that := \bigoplus_\ge f_N} \pi_ Example. The unitary symplectic group or quaternionic unitary group, denoted Sp(''N'') or ''U''(''N'', H), is the group of all transformations of H''N'' which commute with right multiplication by the quaternions H and preserve the H-valued hermitian inner product :$(q\_1,\backslash ldots,q\_N)\backslash cdot\; (r\_1,\backslash ldots,r\_N)\; =\; \backslash sum\; r\_i^$ *q_i on H''N'', where ''q'' * denotes the quaternion conjugate to ''q''. Realizing quaternions as 2 x 2 complex matrices, the group Sp(''N'') is just the group of block matrices (''q''''ij'') in SU(2''N'') with :$q\_=\backslash begin$ \alpha_&\beta_\\ -\overline_&\overline_ \end, where α''ij'' and β''ij'' are complex numbers. Each matrix ''U'' in Sp(''N'') is conjugate to a block diagonal matrix with entries :$q\_i=\backslash begin$ z_i&0\\ 0&\overline_i \end, where |''z''''i''| = 1. Thus the eigenvalues of ''U'' are (''z''''i''±1). The irreducible representations of Sp(''N'') are labelled by signatures :$\backslash mathbf\; \backslash ,\backslash colon\; \backslash ,f\_1\backslash ge\; f\_2\backslash ge\; \backslash cdots\; \backslash ge\; f\_N\backslash ge\; 0$ where the ''f''''i'' are integers. The character of the corresponding irreducible representation σf is given by :$\backslash mathrm\; \backslash ,\; \backslash sigma\_\backslash ,\; z\_j^\; -\; z\_j^\backslash over\; \backslash prod\; (z\_i-z\_i^)\backslash cdot\; \backslash prod\_\; (z\_i\; +z\_i^\; -\; z\_j\; -\; z\_j^)\}.$ The branching rule from Sp(''N'') to Sp(''N'' – 1) states that :(N-1)}= \bigoplus_,\mathbf) \sigma_ Here ''f''''N'' + 1 = 0 and the multiplicity ''m''(f, g) is given by :$m(\backslash mathbf,\backslash mathbf)=\backslash prod\_^N\; (a\_i\; -\; b\_i\; +1)$ where :$a\_1\backslash ge\; b\_1\; \backslash ge\; a\_2\; \backslash ge\; b\_2\; \backslash ge\; \backslash cdots\; \backslash ge\; a\_N\; \backslash ge\; b\_N=0$ is the non-increasing rearrangement of the 2''N'' non-negative integers (''f''i), (''g''''j'') and 0. Example. The branching from U(2''N'') to Sp(''N'') relies on two identities of Littlewood: :$\backslash sum\_\; \backslash mathrm\backslash Pi\_(z\_1,z\_1^,\backslash ldots,\; z\_N,z\_N^)\; \backslash cdot\; \backslash mathrm\backslash pi\_\; \backslash mathrm\backslash sigma\_\backslash pi\_\; (1-z\_iz\_j)^,$ where Πf,0 is the irreducible representation of U(2''N'') with signature ''f''1 ≥ ··· ≥ ''f''''N'' ≥ 0 ≥ ··· ≥ 0. :$\backslash prod\_\; (1-z\_iz\_j)^\; =\; \backslash sum\_\}\; \backslash mathrm\backslash ,\; \backslash pi\_(z\_1,\backslash ldots,z\_N),$ where ''f''''i'' ≥ 0. The branching rule from U(2''N'') to Sp(''N'') is given by :|_= \bigoplus_,\,\, g_=g_} M(\mathbf, \mathbf;\mathbf) \sigma_ where all the signature are non-negative and the coefficient ''M'' (g, h; k) is the multiplicity of the irreducible representation πk of U(''N'') in the tensor product πg $\backslash otimes$ πh. It is given combinatorially by the Littlewood–Richardson rule, the number of lattice permutations of the skew diagram k/h of weight g.〔 There is an extension of Littelwood's branching rule to arbitrary signatures due to . The Littlewood–Richardson coefficients ''M'' (g, h; f) are extended to allow the signature f to have 2''N'' parts but restricting g to have even column-lengths (''g''2''i'' – 1 = ''g''2''i''). In this case the formula reads :(N)}= \bigoplus_,\,\, g_=g_} M_N(\mathbf, \mathbf;\mathbf) \sigma_ where ''M''''N'' (g, h; f) counts the number of lattice permutations of f/h of weight g are counted for which 2''j'' + 1 appears no lower than row ''N'' + ''j'' of f for 1 ≤ ''j'' ≤ |''g''|/2. Example. The special orthogonal group SO(''N'') has irreducible ordinary and spin representations labelled by signatures〔〔 * $f\_1\backslash ge\; f\_2\; \backslash ge\; \backslash cdots\; \backslash ge\; f\_\backslash ge|f\_n|$ for ''N'' = 2''n''; *$f\_1\; \backslash ge\; f\_2\; \backslash ge\; \backslash cdots\; \backslash ge\; f\_n\; \backslash ge\; 0$ for ''N'' = 2''n''+1. The ''f''''i'' are taken in Z for ordinary representations and in ½ + Z for spin representations. In fact if an orthogonal matrix ''U'' has eigenvalues ''z''''i''±1 for 1 ≤ ''i'' ≤ ''n'', then the character of the corresponding irreducible representation πf is given by :$\backslash mathrm\; \backslash ,\; \backslash pi\_\backslash ,\; (z\_j^\; +\; z\_j^)\backslash over\; \backslash prod\_\; (z\_i\; +z\_i^-z\_j-z\_j^)\}$ for ''N'' = 2''n'' and by :$\backslash mathrm\; \backslash ,\; \backslash pi\_\backslash ,\; (z\_j^\; -\; z\_j^)\backslash over\; \backslash prod\_\; (z\_i\; +z\_i^-z\_j-z\_j^)\; \backslash cdot\backslash prod\_k(z\_k^\; -z\_k^)\}$ for ''N'' = 2''n''+1. The branching rules from SO(''N'') to SO(''N'' – 1) state that := \bigoplus_\ge f_n \ge |g_n|} \pi_ for ''N'' = 2''n''+1 and := \bigoplus_\ge |f_n|} \pi_ for ''N'' = 2''n'', where the differences ''f''''i'' - ''g''''i'' must be integers. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Restricted representation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.